Self-adjusting Data Structures for External Memory String Access
ثبت نشده
چکیده
منابع مشابه
Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage
We present a self-adjusting layout scheme for suffix trees in secondary storage that provides optimal number of disk accesses for a sequence of string or substring queries. This has been an open problem since Sleator and Tarjan presented their splaying technique to create self-adjusting binary search trees in 1985. In addition to resolving this open problem, our scheme provides two additional a...
متن کاملObtaining Provably Good Performance from Suffix Trees in Secondary Storage
Designing external memory data structures for string databases is of significant recent interest due to the proliferation of biological sequence data. The suffix tree is an important indexing structure that provides optimal algorithms for memory bound data. However, string Btrees provide the best known asymptotic performance in external memory for substring search and update operations. Work on...
متن کاملRoman Dementiev Algorithm Engineering for Large Data Sets
In recent years, the development of theoretically I/O-efficient algorithms and data structures has received considerable attention. However, much less has been done to evaluate their performance, in particular with parallel disks or when running on large inputs with sizes that really require external memory. This thesis presents the software library Stxxl that enables practice-oriented experime...
متن کاملImplementation and Evaluation of String B-Tree
String B-tree is a combination of B-tree and Patricia tries for internal-node indices. Instead of storing prefix compressed keys at each index node, each key is stored in full in a consecutive sequence of data blocks, and each downward-traversal decision is made by a combination of Patricia trie search and the consultation of a single key. String B-tree has the same worst case performance as B-...
متن کاملSpace-efficient Data Structures for String Searching and Retrieval
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii Chapter 1: Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 The Models of Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Our Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001